An iterative method for solving nonlinear equations
نویسندگان
چکیده
منابع مشابه
AN ITERATIVE METHOD WITH SIX-ORDER CONVERGENCE FOR SOLVING NONLINEAR EQUATIONS
Modification of Newtons method with higher-order convergence is presented. The modification of Newtons method is based on Frontinis three-order method. The new method requires two-step per iteration. Analysis of convergence demonstrates that the order of convergence is 6. Some numerical examples illustrate that the algorithm is more efficient and performs better than classical Newtons method and ...
متن کاملA Three-Point Iterative Method for Solving Nonlinear Equations with High Efficiency Index
In this paper, we proposed a three-point iterative method for finding the simple roots of non- linear equations via mid-point and interpolation approach. The method requires one evaluation of the derivative and three(3) functions evaluation with efficiency index of 81/4 ≈ 1.682. Numerical results reported here, between the proposed method with some other existing methods shows that our method i...
متن کاملA New Iterative Method For Solving Fuzzy Integral Equations
In the present work, by applying known Bernstein polynomials and their advantageous properties, we establish an efficient iterative algorithm to approximate the numerical solution of fuzzy Fredholm integral equations of the second kind. The convergence of the proposed method is given and the numerical examples illustrate that the proposed iterative algorithm are valid.
متن کاملA New Iterative Method for Solving Nonlinear Equations
In this study, a new root-finding method for solving nonlinear equations is proposed. This method requires two starting values that do not necessarily bracketing a root. However, when the starting values are selected to be close to a root, the proposed method converges to the root quicker than the secant method. Another advantage over all iterative methods is that; the proposed method usually c...
متن کاملA New Iterative Method for Solving Nonlinear Equations
In this study, a new root-finding method for solving nonlinear equations is proposed. This method requires two starting values that do not necessarily bracketing a root. However, when the starting values are selected to be close to a root, the proposed method converges to the root quicker than the secant method. Another advantage over all iterative methods is that; the proposed method usually c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 2007
ISSN: 0377-0427
DOI: 10.1016/j.cam.2006.02.015